Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
251	6th issue, August 14, 2003 Workshop on Combinatorics, Linear Algebra and Graph Coloring ∞ Add to Reading List Source URL: math.ipm.ac.ir Language: English - Date: 2011-09-28 01:06:31
252	Retargetable Graph-Coloring Register Allocation for Irregular Architectures Johan Runeson and Sven-Olof Nystr¨ om Department of Information Technology Uppsala University Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2003-09-04 09:21:15
253	Strong Edge-Coloring of a Random Graph Related to Video-streaming March 5, 2015 Let U be a set of users and F be a set of files. Each user has stored each Add to Reading List Source URL: payam-research.atwebpages.com Language: English - Date: 2015-03-05 05:31:38
254	1st issue, August 9, 2003 Workshop on Combinatorics, Linear Algebra and Graph Coloring ∞ Add to Reading List Source URL: math.ipm.ac.ir Language: English - Date: 2011-09-28 01:06:31
255	BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science Add to Reading List Source URL: www.brics.dk Language: English - Date: 2005-04-05 15:07:30 NP-complete problems Boolean satisfiability problem NP-complete Satisfiability Maximum cut Algorithm Graph coloring 2-satisfiability Theoretical computer science Mathematics Applied mathematics
256	Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-01-05 11:55:55 Tree decomposition Graph coloring Minor Tree Robertson–Seymour theorem Clique Neighbourhood Graph Bipartite graph Graph theory Graph operations Planar graphs
257	KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2015-01-03 02:07:55 Graph Graph coloring Planar separator theorem Path decomposition Graph theory NP-complete problems Graph partition
258	De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-06-25 09:37:09 Connectivity Matching Degree Graph operations Graph coloring Theoretical computer science Mathematics Graph theory
259	Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-01-23 02:46:03 Outerplanar graph Tree decomposition Minor Graph coloring Graph Tree Path decomposition Degeneracy Graph theory Planar graphs Graph operations
260	An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2 Add to Reading List Source URL: www.tiberiocaetano.com Language: English - Date: 2008-05-10 06:35:04 Clique Chordal graph Line graph Matching Markov random field Graphical model Graph coloring Clique problem Graph theory Graph operations Tree decomposition

UPDATE